Queries Routing In Super-Peer-Based System: Simulation and Evaluation

Peer-to-peer (P2P) computing is currently attracting enormous attention. P2P systems have emerged as a popular way to share huge volumes of data. In such systems each peer is a database management system in itself, ex-posing its own schema. A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. In such settings, the main objective is the efficient search across peer databases by processing each incoming query without overly consuming bandwidth. In this paper, we propose an architecture based on (super-)peers, and we focus on query routing. Our approach considers that (super-)Peers having similar interests are grouped together for an efficient query routing method. In such groups, called Knowledge-SuperPeers (KSP), super-peers submit queries that are often processed by members of this group. A KSP is a specific super-peer which contains knowledge about: 1. its superpeers and 2. The others super-peers. Knowledge is extracted by using data mining techniques (e.g. decision tree algorithms) starting from queries of peers that transit on the network. The advantage of this distributed knowledge is that, it avoids to making semantic mapping, between heterogeneous data sources owned by (super-)peers, each time the system decides to route query to other (super)peers. The set of KSP improves the robustness in queries routing mechanism and scalability in P2P Network. Compared with a baseline approach, our proposal shows a better performance using a new simulator with respect to important criteria such as response time, precision and